Connecting SAT Algorithms and Complexity Lower Bounds
نویسنده
چکیده
I will describe prior and current work on connecting the art of finding good satisfiability algorithms with the art of proving complexity lower bounds: proofs of limitations on what problems can be solved by good algorithms. Surprisingly, even minor algorithmic progress on solving the circuit satisfiability problem faster than exhaustive search can be applied to prove strong circuit complexity lower bounds. These connections have made it possible to prove new complexity lower bounds that had long been conjectured, and they suggest concrete directions for
منابع مشابه
T C C C
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP * ACC0, which proceeds via a new algorithm for ACC0-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in th...
متن کاملIronic Complicity: Satisfiability Algorithms and Circuit Lower Bounds
I discuss recent progress in developing and exploiting connections between SAT algorithms and circuit lower bounds. The centrepiece of the article is Williams’ proof that NEXP 6⊆ ACC, which proceeds via a new algorithm for ACC-SAT beating brute-force search. His result exploits a formal connection from non-trivial SAT algorithms to circuit lower bounds. I also discuss various connections in the...
متن کاملFinding Hard Instances of the Satisfiability Problem
Finding sets of hard instances of propositional satissability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the ...
متن کاملWorst-Case Upper Bounds
There are many algorithms for testing satisfiability — how to evaluate and compare them? It is common (but still disputable) to identify the efficiency of an algorithm with its worst-case complexity. From this point of view, asymptotic upper bounds on the worst-case running time and space is a criterion for evaluation and comparison of algorithms. In this chapter we survey ideas and techniques ...
متن کاملLecture 1 : Course Overview and Turing machine complexity
1. Basic properties of Turing Machines (TMs), Circuits & Complexity 2. P, NP, NP-completeness, Cook-Levin Theorem. 3. Hierarchy theorems, Circuit lower bounds. 4. Space complexity: PSPACE, PSPACE-completeness, L, NL, Closure properties 5. Polynomial-time hierarchy 6. #P and counting problems 7. Randomized complexity 8. Circuit lower bounds 9. Interactive proofs & PCP Theorem Hardness of approxi...
متن کامل